A hybrid algorithm for stochastic single-source capacitated facility location problem with service level requirements
نویسندگان
چکیده
منابع مشابه
A New Hybrid Algorithm to Optimize Stochastic-fuzzy Capacitated Multi-Facility Location-allocation Problem
Facility location-allocation models are used in a widespread variety of applications to determine the number of required facility along with the relevant allocation process. In this paper, a new mathematical model for the capacitated multi-facility location-allocation problem with probabilistic customer's locations and fuzzy customer’s demands under the Hurwicz criterion is proposed. Thi...
متن کاملa new hybrid algorithm to optimize stochastic-fuzzy capacitated multi-facility location-allocation problem
facility location-allocation models are used in a widespread variety of applications to determine the number of required facility along with the relevant allocation process. in this paper, a new mathematical model for the capacitated multi-facility location-allocation problem with probabilistic customer's locations and fuzzy customer’s demands under the hurwicz criterion is proposed. ...
متن کاملApproximation algorithm for k-level hard capacitated facility location problem
In this paper, we consider k-level hard capacitated facility location problem.
متن کاملA New Hybrid Algorithm to Optimize Stochastic-fuzzy Capacitated Multi-Facility Location-allocation Problem
Facility location-allocation models are used in a widespread variety of applications to determine the number of required facility along with the relevant allocation process. In this paper, a new mathematical model for the capacitated multi-facility location-allocation problem with probabilistic customer's locations and fuzzy customer’s demands under the Hurwicz criterion is proposed. This model...
متن کاملAn improved cut-and-solve algorithm for the single-source capacitated facility location problem
In this paper we present an improved cut–and–solve algorithm for the single– source capacitated facility location problem. The algorithm consists of three phases. The first phase strengthens the integer program by a cutting plane algorithm to obtain a tight lower bound. The second phase uses a two level local branching heuristic to find an upper bound and, if optimality has not yet been establi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2016
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2015.10.001